Shape Analysis with Structural Invariant Checkers
نویسندگان
چکیده
Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the desired shape invariants. We observe that data structure checking code (e.g., used in testing or dynamic analysis) provides shape information that can also be used in static analysis. In this paper, we propose a lightweight, automatic shape analysis based on these developer-supplied structural invariant checkers. In particular, we set up a parametric abstract domain, which is instantiated with such checker specifications to summarize memory regions using both notions of complete and partial checker evaluations. The analysis then automatically derives a strategy for canonicalizing or weakening shape invariants.
منابع مشابه
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking In Proc. Tools and Algorithms for the Construction and Analysis of Systems
Salsa is an invariant checker for speci cations in SAL (the SCR Abstract Language). To establish a formula as an invariant without any user guidance Salsa carries out an induction proof that utilizes tightly integrated decision procedures, currently a combination of BDD algorithms and a constraint solver for integer linear arithmetic, for discharging the veri cation conditions. The user interfa...
متن کاملAnalysis of Agent-Based Systems Using Decision Procedures
In recent years, model checking has emerged as a remarkably eeective technique for the automated analysis of descriptions of hardware systems and communication protocols. To analyze software system descriptions, however, a direct application of model checking rarely succeeds 1, 3], since these descriptions often have huge (often innnite) state spaces which are not amenable to the nite-state met...
متن کاملSalsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL (the SCR Abstract Language). To establish a formula as an invariant without any user guidance Salsa carries out an induction proof that utilizes tightly integrated decision procedures, currently a combination of BDD algorithms and a constraint solver for integer linear arithmetic, for discharging the veri cation conditions. The user interfa...
متن کاملRelational Refinement Types for Higher-Order Shape Transformers (Invited Talk)
Understanding, discovering, and proving useful properties of sophisticated data structures are central problems in program verification. A particularly challenging exercise for shape analyses involves reasoning about sophisticated shape transformers that preserve the shape of a data structure (e.g., the data structure skeleton is always maintained as a balanced tree) or the relationship among v...
متن کاملISOGEOMETRIC STRUCTURAL SHAPE OPTIMIZATION USING PARTICLE SWARM ALGORITHM
One primary problem in shape optimization of structures is making a robust link between design model (geometric description) and analysis model. This paper investigates the potential of Isogeometric Analysis (IGA) for solving this problem. The generic framework of shape optimization of structures is presented based on Isogeometric analysis. By discretization of domain via NURBS functions, the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007